Inductive data flow graphs
نویسندگان
چکیده
منابع مشابه
Flow Graphs and Data Mining
In this paper we propose a new approach to data mining and knowledge discovery based on information flow distribution in a flow graph. Flow graphs introduced in this paper are different from those proposed by Ford and Fulkerson for optimal flow analysis and they model flow distribution in a network rather than the optimal flow which is used for information flow examination in decision algorithm...
متن کاملContactless inductive flow tomography.
The three-dimensional velocity field of a propeller-driven liquid metal flow is reconstructed by a contactless inductive flow tomography. The underlying theory is presented within the framework of an integral equation system that governs the magnetic field distribution in a moving electrically conducting fluid. For small magnetic Reynolds numbers this integral equation system can be cast into a...
متن کاملInductive representations of RDF graphs
RDF forms the basis of the semantic web technology stack. It is based on a directed graph model where nodes and edges are identified by URIs. Occasionally, such graphs contain literals or blank nodes. The existential nature of blank nodes complicates the graph representation. In this paper we propose a purely functional representation of RDF graphs using a special form of inductive graphs calle...
متن کاملThroughput Constraint for Synchronous Data Flow Graphs
Stream (data-flow) computing is considered an effective paradigm for parallel programming of high-end multi-core architectures for embedded applications (networking, multimedia, wireless communication). Our work addresses a key step in stream programming for embedded multicores, namely, the efficient mapping of a synchronous data-flow graph (SDFG) onto a multi-core platform subject to a minimum...
متن کاملStatic Scheduling for Synchronous Data Flow Graphs
This paper addresses the issue of determining the iteration bound for a synchronous data flow graph (SDFG) and determining whether or not a SDFG is live based on some calculations done. The main result of this paper is finding an iteration bound equation that is used to find an integral static schedule for the SDFG, where a node is issued at the beginning of a clock cycle. We show that we can s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2013
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2480359.2429086